ZU WALTHER 44, 9.

Walther Recursion

Primitive recursion is a well known syntactic restriction on recursive deenitions which guarantees termination. Unfortunately many natural deenitions, such as the most common deenition of Euclid's GCD algorithm, are not primitive recursive. Walther has recently given a proof system for verifying termination of a broader class of deenitions. Although Walther's system is highly automatible, the c...

ConnCensus Vol. 44 No. 9

The Static Universe of Walther Nernst

Walther Nernst (1864-1941) was, without a doubt, one of the most remarkable physicists of the early 20th century. His main accomplishments were in the field of physical chemistry, a discipline he founded together with other well-known scientists, including J.H. van’t Hoff, W. Ostwald and S. Arrhenius. His most famous contribution to physics was the so-called third law of thermodynamics, for whi...

Tobias Walther: Floating ideas on lipids

T he fl uid mosaic model of membrane biology depicts proteins and lipids freely roaming in the lateral plane of the cell's plasma membrane. But in reality, the plasma membrane is highly compartmentalized. One such compartment is delineated by a protein scaffold beneath the membrane called the eisosome (from the Greek word eis, meaning " portal, " and soma, meaning " body "). Tobias Walther, tog...

Automated Termination Proofs Using Walther Recursion

In this thesis, I present an improved method for automatic proofs of termination through a syntactic measurement of sizing that was first developed by Walther. We discuss formal requirements for proving termination using this method and how it can be generalized to other languages. We present a simple set-theoretic language as an example which can be used to write basic Lisp-like programs. Usin...